Planning of Optimal Collision Avoidance Trajectories with Timed Elastic Bands

نویسندگان

  • Martin Keller
  • Frank Hoffmann
  • Torsten Bertram
  • Carsten Hass
  • Alois Seewald
چکیده

This paper is concerned with the planning of optimal trajectories for vehicle collision avoidance with a Timed Elastic Band (TEB) framework. The avoidance trajectory is represented by a TEB which is optimized with respect to multiple partially conflicting objectives. The resulting trajectory constitutes the optimal compromise between a mere braking and a lane change maneuver that avoids the collision with the smoothest feasible path. The approach is applicable to general critical traffic situations as the TEB considers the constraints imposed by the vehicle dynamics, road boundaries, static obstacles and moving vehicles.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Path Planning for Automotive Collision Avoidance Based on Elastic Bands

Collision-free path planning will be an essential feature of future automotive collision avoidance systems (CAS). One of the most promising approaches uses so-called elastic bands in generating emergency trajectories. For the automotive application of this approach, moving obstacles and the borders of the road are modeled by virtual potential fields. To find solutions even in complex driving si...

متن کامل

Direct Optimal Motion Planning for Omni-directional Mobile Robots under Limitation on Velocity and Acceleration

This paper describes a low computational direct approach for optimal motion planning and obstacle avoidance of Omni-directional mobile robots within velocity and acceleration constraints on the robot motion. The main purpose of this problem is the minimization of a quadratic cost function while limitation on velocity and acceleration of robot is considered and collision with any obstacle in the...

متن کامل

Aircraft Trajectory Planning With Collision Avoidance Using Mixed Integer Linear Programming

This paper describes a method for finding optimal trajectories for multiple aircraft avoiding collisions. Recent developments in spacecraft path-planning have shown that trajectory optimization including collision avoidance can be written as a linear program subject to mixed integer constraints, known as a mixed-integer linear program (MILP). This can be solved using commercial software written...

متن کامل

Finding Near-optimal Solutions in Multi-robot Trajectory Planning

We deal with the problem of planning collisionfree trajectories for robots operating in a shared space. Given the start and destination position for each of the robots, the task is to find trajectories for all robots that reach their destinations with minimum total cost such that the robots will not collide when following the found trajectories. Our approach starts from individually optimal tra...

متن کامل

Finding Near-optimal Solutions in Multi-robot Path Planning

We deal with the problem of planning collisionfree trajectories for robots operating in a shared space. Given the start and destination position for each of the robots, the task is to find trajectories for all robots that reach their destinations with minimum total cost such that the robots will not collide when following the found trajectories. Our approach starts from individually optimal tra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014